A Min-max Regret Robust Optimization Approach for Large Scale Full Factorial Scenario Design of Data Uncertainty

نویسندگان

  • Tiravat Assavapokee
  • Matthew J. Realff
  • Jane C. Ammons
چکیده

This paper presents a three-stage optimization algorithm for solving two-stage robust decision making problems under uncertainty with min-max regret objective. The structure of the first stage problem is a general mixed integer (binary) linear programming model with a specific model of uncertainty that can occur in any of the parameters, and the second stage problem is a linear programming model. Each uncertain parameter can take its value from a finite set of real numbers with unknown probability distribution independently of other parameters’ settings. This structure of parametric uncertainty is referred to in this paper as the full-factorial scenario design of data uncertainty. The proposed algorithm is shown to be efficient for solving large-scale min-max regret robust optimization problems with this structure. The algorithm coordinates three mathematical programming formulations to solve the overall optimization problem. The main contributions of this paper are the theoretical development of the three-stage optimization algorithm, and improving its computational performance through model transformation, decomposition, and pre-processing techniques based on analysis of the problem structure. The proposed algorithm is applied to solve a number of robust facility location problems under this structure of parametric uncertainty. All results illustrate significant improvement in computation time of the proposed algorithm over existing approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robust Reliable Closed Loop Supply Chain Network Design under Uncertainty: A Case Study in Equipment Training Centers

The aim of this paper is to propose a robust reliable bi-objective supply chain network design (SCND) model that is capable of controlling different kinds of uncertainties, concurrently. In this regard, stochastic bi-level scenario based programming approach which is used to model various scenarios related to strike of disruptions. The well-known method helps to overcome adverse effects of disr...

متن کامل

A Robust Scenario Based Approach in an Uncertain Condition Applied to Location-Allocation Distribution Centers Problem

The paper discusses the location-allocation model for logistic networks and distribution centers through considering uncertain parameters. In real-world cases, demands and transshipment costs change over the period of the time. This may lead to large cost deviation in total cost. Scenario based robust optimization approaches are proposed where occurrence probability of each scenario is not know...

متن کامل

Operational planning of oil refineries under uncertainty Special issue: Applied Stochastic Optimization

In this paper, we describe a non-linear programming model for operational planning of oil refineries, considering exogenous (external) and endogenous (internal) uncertainties. Three mathematical models based on stochastic programming (two-stage stochastic model) and robust programming (min–max regret model and max–min model) are developed to address these uncertainties. The main purpose of this...

متن کامل

On Scenario Aggregation to Approximate Robust Combinatorial Optimization Problems

As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research in approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and well-known approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, th...

متن کامل

On Scenario Aggregation to Approximate Robust Optimization Problems

As most robust combinatorial min-max and min-max regret problems with discrete uncertainty sets are NP-hard, research into approximation algorithm and approximability bounds has been a fruitful area of recent work. A simple and wellknown approximation algorithm is the midpoint method, where one takes the average over all scenarios, and solves a problem of nominal type. Despite its simplicity, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007